Termination of Narrowing
نویسنده
چکیده
Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and replacing matching with unifcationn Narrowing has been widely used in different contexts, ranging from theorem proving to language designn Surprisingly, the termination of narrowing has been mostly overlookedn In this paper, we present a new approach for analyzing the termination of narrowing in left-linear constructor systems (a widely accepted class of systems) that allowsus to reuse existing methods in the literature on termination of rewritingn
منابع مشابه
Modular Termination of Basic Narrowing
Basic narrowing is a restricted form of narrowing which constrains narrowing steps to a set of non-blocked (or basic) positions. Basic narrowing has a number of important applications including equational unification in canonical theories. Another application is analyzing termination of narrowing by checking the termination of basic narrowing, as done in pioneering work by Hullot. In this work,...
متن کاملTermination of Narrowing: Automated Proofs and Modularity Properties
In 1936, Alan Turing proved that the halting problem, that is, deciding whether a program terminates, is an undecidable problem for most practical programming languages. Even so, termination is so relevant that a vast number of techniques for proving the termination of programs have been researched in the recent decades. Term rewriting systems provide an abstract theoretical framework ideally s...
متن کاملModular termination of basic narrowing and equational unification
Basic narrowing is a restricted form of narrowing which constrains narrowing steps to a set of unblocked (or basic) positions. In this work, we study the modularity of termination of basic narrowing in hierarchical combinations of TRSs, which provides new algorithmic criteria to prove termination of basic narrowing. Basic narrowing has a number of important applications including equational uni...
متن کاملRelative Termination
"Relative termination" is a property that generalizes both termination and "termination modulo". In order to prove that a term rewrite system relatively terminates, one may reuse the common termination quasiorderings. Further proof methods become available by the cooperation property. Relative termination sets up new proof techniques for termination and confluence. The usefulness of the notion ...
متن کاملTermination of Narrowing Using Dependency Pairs
In this work, we extend the dependency pair approach for automated proofs of termination in order to automate the termination proofs of narrowing. Narrowing is a generalization of term rewriting that allows free variables in terms (as in logic programming) and replaces pattern matching by syntactic unification. Narrowing has a number of important applications including execution of functional–l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009